set comprehension การใช้

• NPL eventually evolved into Hope but lost set comprehensions, which made a reappearance in the form of list comprehensions in later functional languages.
• The NPL interpreter evaluates the list of generators from left to right so conditions can mention any bound variables that occur to their left . These were known as set comprehensions.
• Unsurprisingly BenRG's set . union is the fastest; the better itertools thing and BenRG's set comprehension are both about 65 % of its speed; the reduce thing comes at a sluggish 18 % .-- Talk 23 : 30, 21 July 2011 ( UTC)